Constraint Processing with Reactive Agents
نویسندگان
چکیده
The integration of methods of Constraint Programming and Multi-Agent-Systems is discussed in this paper. We describe different agent topologies for Constraint Satisfaction Problems and discuss their properties with a special focus on dynamic and distributed settings. This motivates our new architecture for constraint processing with reactive agents. The resulting systems are very flexible and can be used to process dynamic and distributed problems. We define the local behaviors of the agents in this new approach and verify their collective behavior in the context of CSP.
منابع مشابه
Reactive Web Agents with Open Constraint Programming
This paper describes a new programming system for writing web applications with reactive agents, i.e. the agents can have complex responses which depend on how the environment changes. Our prototype system is based on the Open Constraint Programming framework using the Constraint Logic Programming language CLP(R). The benefit of reactive web agents is that activities of agents can be coordinate...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملCollective Problem Solving through Coordination in a Society of Reactive Agents
We present a methodology, called Constraint Partition and Coordinated Reaction (CP&CR), where a problem solution emerges from the evolving computational process of a group of diverse, interacting reactive agents. Problem characteristics are utilized to achieve problem solving by asynchronous and well coordinated local interactions. The coordination mechanisms guide the search space exploration ...
متن کاملConstraint-Directed Improvisation for Complex Domains
Current approaches to reactive planning are limited in their ability to perform well in domains characterized by complexity and significant variability, their ability to perform in domains with which they are less than completely familiar, and by their reliance on local information for decision making. In this paper, we present a novel architecture known as Waffler, based on constraint-directed...
متن کاملAgent Based Processing of Global Evaluation Function
Load balancing across a networked environment is a monotonous job. Moreover, if the job to be distributed is a constraint satisfying one, the distribution of load demands core intelligence. This paper proposes parallel processing through Global Evaluation Function by means of randomly initialized agents for solving Constraint Satisfaction Problems. A potential issue about the number of agents i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004